Constraint satisfaction parameterized by solution size

In the constraint satisfaction problem (CSP) corresponding to a constraint language (i.e., a set of relations) $\Gamma$, the goal is to find an assignment of values to variables so that a given set of constraints specified by relations from $\Gamma$ is satisfied. The complexity of this problem has received substantial amount of attention in the past decade. In this paper we study the fixed-parameter tractability of constraint satisfaction problems parameterized by the size of the solution in the following sense: one of the possible values, say 0, is "free," and the number of variables allowed to take other, "expensive," values is restricted. A size constraint requires that exactly $k$ variables take nonzero values. We also study a more refined version of this restriction: a global cardinality constraint prescribes how many variables have to be assigned each particular value. We study the parameterized complexity of these types of CSPs where the parameter is the required number $k$ of nonzero variables. As special cases, we can obtain natural and well-studied parameterized problems such as Independent Set, Vertex Cover, d-Hitting Set, Biclique, etc. In the case of constraint languages closed under substitution of constants, we give a complete characterization of the fixed-parameter tractable cases of CSPs with size constraints, and we show that all the remaining problems are W[1]-hard. For CSPs with cardinality constraints, we obtain a similar classification, but for some of the problems we are only able to show that they are Biclique-hard. The exact parameterized complexity of the Biclique problem is a notorious open problem, although it is believed to be W[1]-hard.Comment: To appear in SICOMP. Conference version in ICALP 201

Optimal General Matchings

Given a graph $G=(V,E)$ and for each vertex $v \in V$ a subset $B(v)$ of the set $\{0,1,\ldots, d_G(v)\}$, where $d_G(v)$ denotes the degree of vertex $v$ in the graph $G$, a $B$-factor of $G$ is any set $F \subseteq E$ such that $d_F(v) \in B(v)$ for each vertex $v$, where $d_F(v)$ denotes the number of edges of $F$ incident to $v$. The general factor problem asks the existence of a $B$-factor in a given graph. A set $B(v)$ is said to have a {\em gap of length} $p$ if there exists a natural number $k \in B(v)$ such that $k+1, \ldots, k+p \notin B(v)$ and $k+p+1 \in B(v)$. Without any restrictions the general factor problem is NP-complete. However, if no set $B(v)$ contains a gap of length greater than $1$, then the problem can be solved in polynomial time and Cornuejols \cite{Cor} presented an algorithm for finding a $B$-factor, if it exists. In this paper we consider a weighted version of the general factor problem, in which each edge has a nonnegative weight and we are interested in finding a $B$-factor of maximum (or minimum) weight. In particular, this version comprises the minimum/maximum cardinality variant of the general factor problem, where we want to find a $B$-factor having a minimum/maximum number of edges. We present an algorithm for the maximum/minimum weight $B$-factor for the case when no set $B(v)$ contains a gap of length greater than $1$. This also yields the first polynomial time algorithm for the maximum/minimum cardinality $B$-factor for this case

A Geography of Cohabitation in the Americas, 1970-2010

In this chapter, we trace the geography of unmarried cohabitation in the Americas on an unprecedented geographical scale in family demography. We present the percentage of partnered women aged 25-29 in cohabitation across more than 19,000 local units of 39 countries, from Canada to Argentina, at two points in time, 2000 and 2010. The local geography is supplemented by a regional geography of cohabitation that covers five decades of data from 1960 to 2010. Our data derive primarily from the rich collection of census microdata amassed by the Centro Latinoamericano y Caribeño de Demografía (CELADE) of the United Nations and from the IPUMS-international collection of harmonized census microdata samples (Minnesota Population Center, Integrated public use microdata series, international: Version 6.3 [Machine-readable database]. University of Minnesota, Minneapolis, 2014). Our analyses unveil a substantial amount of spatial heterogeneity both within and across countries. Despite the spectacular rise in cohabitation, its regional patterning has remained relatively unchanged over the last decades, which points to the presence of geo-historical legacies in the present patterns of unmarried cohabitation

Solution-based synthesis of kesterite thin film semiconductors

Large-scale deployment of photovoltaic modules is required to power our renewable energy future. Kesterite, Cu2ZnSn(S, Se)4, is a p-type semiconductor absorber layer with a tunable bandgap consisting of earth abundant elements, and is seen as a potential 'drop-in' replacement to Cu(In,Ga)Se2 in thin film solar cells. Currently, the record light-to-electrical power conversion efficiency (PCE) of kesterite-based devices is 12.6%, for which the absorber layer has been solution-processed. This efficiency must be increased if kesterite technology is to help power the future. Therefore two questions arise: what is the best way to synthesize the film? And how to improve the device efficiency? Here, we focus on the first question from a solution-based synthesis perspective. The main strategy is to mix all the elements together initially and coat them on a surface, followed by annealing in a reactive chalcogen atmosphere to react, grow grains and sinter the film. The main difference between the methods presented here is how easily the solvent, ligands, and anions are removed. Impurities impair the ability to achieve high performance (>∼10% PCE) in kesterite devices. Hydrazine routes offer the least impurities, but have environmental and safety concerns associated with hydrazine. Aprotic and protic based molecular inks are environmentally friendlier and less toxic, but they require the removal of organic and halogen species associated with the solvent and precursors, which is challenging but possible. Nanoparticle routes consisting of kesterite (or binary chalcogenides) particles require the removal of stabilizing ligands from their surfaces. Electrodeposited layers contain few impurities but are sometimes difficult to make compositionally uniform over large areas, and for metal deposited layers, they have to go through several solid-state reaction steps to form kesterite. Hence, each method has distinct advantages and disadvantages. We review the state-of-the art of each and provide perspective on the different strategies.Fil: Todorov, I. T.. IBM Research. Thomas J. Watson Research Center; Estados UnidosFil: Hillhouse, H. W.. University of Washington; Estados UnidosFil: Aazou, S.. Mohammed V University; MarruecosFil: Sekkat, Z.. Mohammed V University; MarruecosFil: Vigil Galán, O.. National Polytechnic Institute; MéxicoFil: Deshmukh, S. D.. Purdue University; Estados UnidosFil: Agrawal, R.. Purdue University; Estados UnidosFil: Bourdais, S.. No especifíca;Fil: Valdes, Matias Hernan. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Mar del Plata. Instituto de Investigaciones en Ciencia y Tecnología de Materiales. Universidad Nacional de Mar del Plata. Facultad de Ingeniería. Instituto de Investigaciones en Ciencia y Tecnología de Materiales; ArgentinaFil: Arnou, P.. University Of Luxembourg; LuxemburgoFil: Mitzi, D.B.. University of Duke; Estados UnidosFil: Dale, P.. University Of Luxembourg; Luxemburg

A time predefined variable depth search for nurse rostering

This paper presents a variable depth search for the nurse rostering problem. The algorithm works by chaining together single neighbourhood swaps into more effective compound moves. It achieves this by using heuristics to decide whether to continue extending a chain and which candidates to examine as the next potential link in the chain. Because end users vary in how long they are willing to wait for solutions, a particular goal of this research was to create an algorithm that accepts a user specified computational time limit and uses it effectively. When compared against previously published approaches the results show that the algorithm is very competitive

Wood Utilization Is Dependent on Catalase Activities in the Filamentous Fungus Podospora anserina

Catalases are enzymes that play critical roles in protecting cells against the toxic effects of hydrogen peroxide. They are implicated in various physiological and pathological conditions but some of their functions remain unclear. In order to decipher the role(s) of catalases during the life cycle of Podospora anserina, we analyzed the role of the four monofunctional catalases and one bifunctional catalase-peroxidase genes present in its genome. The five genes were deleted and the phenotypes of each single and all multiple mutants were investigated. Intriguingly, although the genes are differently expressed during the life cycle, catalase activity is dispensable during both vegetative growth and sexual reproduction in laboratory conditions. Catalases are also not essential for cellulose or fatty acid assimilation. In contrast, they are strictly required for efficient utilization of more complex biomass like wood shavings by allowing growth in the presence of lignin. The secreted CATB and cytosolic CAT2 are the major catalases implicated in peroxide resistance, while CAT2 is the major player during complex biomass assimilation. Our results suggest that P. anserina produces external H2O2 to assimilate complex biomass and that catalases are necessary to protect the cells during this process. In addition, the phenotypes of strains lacking only one catalase gene suggest that a decrease of catalase activity improves the capacity of the fungus to degrade complex biomass

Does Kin Recognition and Sib-Mating Avoidance Limit the Risk of Genetic Incompatibility in a Parasitic Wasp?

Background: When some combinations of maternal and paternal alleles have a detrimental effect on offspring fitness, females should be able to choose mates on the basis of their genetic compatibility. In numerous Hymenoptera, the sex of an individual depends of the allelic combination at a specific locus (single-locus Complementary Sex Determination), and in most of these species individuals that are homozygous at this sexual locus develop into diploid males with zero fitness. Methods and Findings: In this paper, we tested the hypothesis of genetic incompatibility avoidance by investigating sibmating avoidance in the solitary wasp parasitoid, Venturia canescens. In the context of mate choice we show, for the first time in a non-social hymenopteran species, that females can avoid mating with their brothers through kin recognition. In ‘‘no-choice’ ’ tests, the probability a female will mate with an unrelated male is twice as high as the chance of her mating with her brothers. In contrast, in choice tests in small test arenas, no kin discrimination effect was observed. Further experiments with male extracts demonstrate that chemical cues emanating from related males influence the acceptance rate of unrelated males. Conclusions: Our results are compatible with the genetic incompatibility hypothesis. They suggest that the female wasps recognize sibs on the basis of a chemical signature carried or emitted by males possibly using a ‘‘self-referent phenotyp